Coset construction of logarithmic minimal models: branching rules and branching functions
نویسندگان
چکیده
منابع مشابه
Brst Invariant Branching Functions of G/h Coset Models
We compute branching functions of G/H coset models using a BRST invariant branching function formulae, i.e. a branching function that respects a BRST invariance of the model. This ensures that only the coset degrees of freedom will propagate. We consider G/H for rank(G/H) = 0 models which includes the Kazama-Suzuki construction, and Gk1 ×Gk2/Gk1+k2 models. Our calculations here confirm in part ...
متن کاملBranching rules revisited
Mixed integer programs are commonly solved with linear programming based branch-and-bound algorithms. The success of the algorithm strongly depends on the strategy used to select the variable to branch on. We present a new generalization called reliability branching of today’s state-of-the-art strong branching and pseudocost branching branching strategies for linear programming based branch-and...
متن کاملPath integral formulation and Feynman rules for phylogenetic branching models
A dynamical picture of phylogenetic evolution is given in terms of Markov models on a state space, comprising joint probability distributions for character types of taxonomic classes. Phylogenetic branching is a process which augments the number of taxa under consideration, and hence the rank of the underlying joint probability state tensor. We point out the combinatorial necessity for a second...
متن کاملBranching Rules for Satis ability
Recent experience suggests that branching algorithms are among the most attractive for solving propositional satissability problems. A key factor in their success is the rule they use to decide on which variable to branch next. We attempt to explain and improve the performance of branching rules with an empirical model-building approach. One model is based on the rationale given for the Jeroslo...
متن کاملFermionic Formulas for Level-restricted Generalized Kostka Polynomials and Coset Branching Functions
Level-restricted paths play an important rôle in crystal theory. They correspond to certain highest weight vectors of modules of quantum affine algebras. We show that the recently established bijection between Littlewood–Richardson tableaux and rigged configurations is well-behaved with respect to level-restriction and give an explicit characterization of level-restricted rigged configurations....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2013
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/46/35/355402